Routing and wavelength assignment in optical passive star networks with non-uniform traffic load

نویسندگان

  • Resit Sendag
  • Peng-fei Chuang
  • David Hung-Chang Du
چکیده

This paper considers the problem of Routing and Wavelength Assignment (RWA) in optical passive star networks with non-uniform traffic load. The problem can be considered as designing a logical topology over an optical passive star physical topology with a given non-uniform traffic. The approach uses the bipartite graphs and the concept of Time and Wavelength Division Multiplexing (TWDM) embedding process to discuss the problem. The non-uniformity of the traffic load makes the logical design computationally hard and requires heuristic algorithms. Then, a linear program can solve the routing. We present an algorithm for effectively assigning a limited number of wavelengths among the access nodes of a WDM multi-hop network, which are connected via passive star topology. In this paper, the RWA problem for such a network with non-uniform traffic load is discussed for the first time. The idea is based on reducing the maximum load on each wavelength by using more wavelengths available. The proposed algorithm is tested on several traffic models, and results are given to show the improvement in the performance of the network using our algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks

Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of  regeneration capabilities, the physical layer i...

متن کامل

Traffic Load Bounds for Optical Burst-Switched Networks with Dynamic Wavelength Allocation

The maximum traffic load that can be supported by a wavelength division multiplexed (WDM) optical burst switched (OBS) network with dynamic wavelength allocation is studied. It is shown that it depends on the requirements of the class of service and on the efficiency of the dynamic routing and wavelength assignment (RWA) algorithm employed. Two methods to build the bursts are presented as well ...

متن کامل

Wavelength Reusability in Wavelength-Routed Optical Networks

Recently routing and wavelength assignment (RWA) problem in wavelength-routed optical networks (WRON's) has been studied extensively. Different optimum criterions are proposed to evaluate the performance of designed networks, such as carried traffic [1], wavelength requirement [2,3], fiber requirement [4], and OXC system scale [5]. Because wavelength is a very limited network resource, most of ...

متن کامل

Dynamic Traffic Grooming using Fixed-Alternate Routing in WDM Mesh Optical Networks

There is a mismatch between lightpath channel capacity and traffic request capacity in wavelength division multiplexed (WDM) optical mesh networks. Traffic grooming is needed to resolve this mismatch in an efficient way. We study the dynamic traffic grooming problem in WDM mesh networks using the fixed-alternate routing (FAR) approach. Based on the FAR approach, we propose the fixed-order groom...

متن کامل

Performance Assessment of Fuzzy Logic Control Routing Algorithm with Different Wavelength Assignments in DWDM Networks

DWDM (Dense Wavelength Division Multiplexing) is an effective technique to make use of the large amount of bandwidth in optical fibers to meet the broadband requirement of multimedia applications. The routing and wavelength assignment (RWA) algorithm efficiently manages optical network resources and is separated from the optical topology. This paper proposes a dynamic LLR algorithm using fuzzy ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001